A New Dynamic Simulated Annealing Algorithm For Global Optimization
نویسندگان
چکیده
منابع مشابه
A new Simulated Annealing algorithm for the robust coloring problem
The Robust Coloring Problem (RCP) is a generalization of the well-known Graph Coloring Problem where we seek for a solution that remains valid when extra edges are added. The RCP is used in scheduling of events with possible last-minute changes and study frequency assignments of the electromagnetic spectrum. This problem has been proved as NP-hard and in instances larger than 30 vertices, meta-...
متن کاملSimulated Annealing and Global Optimization
Nelder-Mead (when you don’t know ∇f ) and steepest descent/conjugate gradient (when you do). Both of these methods are based on attempting to generate a sequence of positions xk with monotonically decreasing f(xk) in the hopes that the xk → x∗, the global minimum for f . If f is a convex function (this happens surprisingly often), and has only one local minimum, these methods are exactly the ri...
متن کاملGlobal optimization and simulated annealing
In this paper we are concerned with global optimization, which can be defined as the problem of finding points on a bounded subset of N" in which some real valued function f assumes its optimal (maximal or minimal) value. We present a stochastic approach which is based on the simulated annealing algorithm. The approach closely follows the formulation of the simulated annealing algorithm as orig...
متن کاملGlobal optimization and simulated annealing
In this paper we are concerned with global optimization, which can be defined as the problem of finding points on a bounded subset of IRn in which some real valued functionf assumes its optimal (i.e. maximal or minimal) value. We present a stochastic approach which is based on the simulated annealing algorithm. The approach closely follows the formulation of the simulated annealing algorithm as...
متن کاملA New Hybrid Simulated Annealing Algorithm for Large Scale Global Optimization
The present paper focus on the improvement of the efficiency of structural optimization, in typical structural optimization problems there may be many locally minimum configurations. For that reason, the application of a global method, which may escape from the locally minimum points, remain essential. In this paper, a new hybrid simulated annealing algorithm for large scale global optimization...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematics and Computer Science
سال: 2015
ISSN: 2008-949X
DOI: 10.22436/jmcs.014.01.02